Counting the number of points on elliptic curves over finite fields of characteristic greater than three
نویسندگان
چکیده
We present a variant of an algorithm of Oliver Atkin for counting the number of points on an elliptic curve over a nite eld. We describe an implementation of this algorithm for prime elds. We report on the use of this implementation to count the number of points on a curve over IFp, where p is a 375-digit prime.
منابع مشابه
Counting the Number of Points on Elliptic Curves over Nite Elds of Characteristic Greater than Three
We present a variant of an algorithm of Oliver Atkin for counting the number of points on an elliptic curve over a nite eld. We describe an implementation of this algorithm for prime elds. We report on the use of this implementation to count the the number points on a curve over F p , where p is a 210-digit prime.
متن کاملAn AGM-type elliptic curve point counting algorithm in characteristic three
Given an ordinary elliptic curve on Hesse form over a finite field of characteristic three, we give a sequence of elliptic curves which leads to an effective construction of the canonical lift, and obtain an algorithm for computing the number of points. Our methods are based on the study of an explicitly and naturally given 3-isogeny between elliptic curves on Hesse form.
متن کاملSatoh ' S Algorithm in Characteristic 2 Berit
We give an algorithm for counting points on arbitrary ordinary elliptic curves over finite fields of characteristic 2, extending the O(log q) method given by Takakazu Satoh, giving the asymptotically fastest point counting algorithm known to date.
متن کاملElliptic curves with a given number of points over finite fields
Given an elliptic curve E and a positive integer N , we consider the problem of counting the number of primes p for which the reduction of E modulo p possesses exactly N points over Fp. On average (over a family of elliptic curves), we show bounds that are significantly better than what is trivially obtained by the Hasse bound. Under some additional hypotheses, including a conjecture concerning...
متن کاملCounting Points for Hyperelliptic Curves of Type y2= x5 + ax over Finite Prime Fields
Counting rational points on Jacobian varieties of hyperelliptic curves over finite fields is very important for constructing hyperelliptic curve cryptosystems (HCC), but known algorithms for general curves over given large prime fields need very long running times. In this article, we propose an extremely fast point counting algorithm for hyperelliptic curves of type y = x + ax over given large...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994